Description: Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside. Platform: |
Size: 57344 |
Author:cc |
Hits:
Description: 区域填充和影线填充原理,算法和实现 图形几何变换,投影变换和视向变换的方法和实现 直线段,多边形裁剪算法和实现 曲线生成原理,算法和实现 常用的消隐算法 -area filling and filling hatched theory, algorithms and graphic geometric transformation, and visual projection transformation to transform the methods and linear, polygon clipping algorithm and the realization Curve theory, algorithms and implementation of the commonly used algorithms blanking Platform: |
Size: 3072 |
Author:王宇 |
Hits:
Description: An article on 2-D Polygon Clipping with the source code-An article on 2-D Polygon with the Clipping source code Platform: |
Size: 57344 |
Author: |
Hits:
Description: 一个有效的多边形裁剪算法，介绍了概念、数据结构、算法、交点判断等-An effective polygon clipping algorithm, introduce the concepts, data structures, algorithms, such as point of intersection to determine Platform: |
Size: 377856 |
Author:曹建国 |
Hits:
Description: 这是基于ＶＣ＋＋采用链表结构设计的多边形裁剪算法,可适用于内、外裁剪-This is based on VC using list the structural design of the polygon clipping algorithm, applied to the inner and outer cutting Platform: |
Size: 1998848 |
Author:kangjianrong |
Hits:
Description: 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures Platform: |
Size: 2048 |
Author:章礼平 |
Hits:
Description: 多边形裁剪程序：用到的是比较常见的裁剪算法：Sutherland-Hodgman算法。本程序中的裁剪顺序为左边、下边、右边、上边，那么裁剪是这样进行的：原待裁剪多边形作为输入多边形被裁剪矩形的左边裁剪，然后输出的裁剪结果作为下边裁剪的输入多边形，……，依次类推，直到最后一边矩形上边裁剪结束。-Polygon clipping process: it is more commonly used method of cutting: Sutherland-Hodgman algorithm. This procedure of cutting the order for the left, bottom, right, top, then the cutting is carried out: the original clipping polygon to be clipped polygon as input the left side of the rectangular cutting, then cutting output cut as the bottom of the input polygon, ... ... , and so on, until the last end side of the rectangular cut above. Platform: |
Size: 65536 |
Author:tomomoon |
Hits:
Description: 了解二维图形裁剪的原理（点的裁剪、直线的裁剪、多边形的裁剪），利用VC+OpenGL实现直线的裁剪算法。
2．实验内容：
（1） 理解直线裁剪的原理（Cohen-Surtherland算法、梁友栋算法）
（2） 利用VC+OpenGL实现直线的编码裁剪算法，在屏幕上用一个封闭矩形裁剪任意一条直线。
（3） 调试、编译、修改程序
-Understanding of the principles of cutting two-dimensional graphics (point of cutting, cutting a straight line, polygon clipping), the use of VC+ OpenGL to achieve a straight line cutting algorithm. 2. Experimental contents: (1) understand the principles of cutting a straight line (Cohen-Surtherland algorithm, You-Xin Liang Dong algorithm) (2) the use of VC+ OpenGL to achieve a straight line cutting the coding algorithm, on the screen in a closed arbitrary rectangular cutting a straight line. (3) debug, compile, modify the program Platform: |
Size: 566272 |
Author:jing |
Hits:
Description: 了解二维图形裁剪的原理（点的裁剪、直线的裁剪、多边形的裁剪），利用VC+OpenGL实现直线的裁剪算法。-Understanding of the principles of cutting two-dimensional graphics (point of cutting, cutting a straight line, polygon clipping), the use of VC+ OpenGL to achieve a straight line cutting algorithm. Platform: |
Size: 4096 |
Author:zhanyun |
Hits:
Search - polygon clipping